The graph-theoretic minimum energy path problem for ionic conduction
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn the Minimum Eccentricity Shortest Path Problem
Find a shortest path P with minimum eccentricity, Find a shortest path P with minimum eccentricity,
متن کاملThe Minimum Energy Expenditure Shortest Path Method
This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path. Given a simple environment in which a character has the ability to perform actions related to locomotion, such as walking and stair stepping, current techniques execute the shortest path based on the length of the extracte...
متن کاملTracing the minimum-energy path on the free-energy surface.
The free-energy profile of a reaction can be estimated in a molecular-dynamics approach by imposing a mechanical constraint along a reaction coordinate (RC). Many recent studies have shown that the temperature can greatly influence the path followed by the reactants. Here, we propose a practical way to construct the minimum-energy path directly on the free-energy surface at a given temperature....
متن کاملGraph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem
We give three new algorithms to solve the “isomorphism of polynomial” problem, which was underlying the hardness of recovering the secret-key in some multivariate trapdoor one-way functions. In this problem, the adversary is given two quadratic functions, with the promise that they are equal up to linear changes of coordinates. Her objective is to compute these changes of coordinates, a task wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2015
ISSN: 2158-3226
DOI: 10.1063/1.4933052